Quasi-twisted codes with constacyclic constituent codes
نویسندگان
چکیده
منابع مشابه
A generalization of quasi-twisted codes: Multi-twisted codes
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this work we introduce a new generalization of QT codes that we call multi-twisted (MT) codes and study some of their basic properties. Presenting several methods o...
متن کاملConstacyclic and quasi-twisted Hermitian self-dual codes over finite fields
Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing xn − λ over Fq2 is given, where λ is a unit in Fq2 . Based on this factorization, the dimensions of the Hermitian hulls of λ-constacyclic codes of length n over Fq2 are determined. The characterization and enumeration of constacyclic Hermitian self-dual (resp., complementary dua...
متن کاملNew linear codes from constacyclic codes
One of the main challenges of coding theory is to construct linear codes with the best possible parameters. Various algebraic and combinatorial methods along with computer searches are used to construct codes with better parameters. Given the computational complexity of determining the minimum distance of a code, exhaustive searches are not feasible for all but small parameter sets. Therefore, ...
متن کاملConstructions of Quasi-Twisted Two-Weight Codes
— A code is said to be two-weight if the non-zero codewords have only two different a weight w 1 and w 2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length can be put in the quasi-twisted form. Based on this transformation, a new construction method of quasi-twisted (QT) two-weight codes is presented. A larg...
متن کاملSome new quasi - twisted ternary linear codes ∗
Let [n, k, d]q code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the basic and most important problems in coding theory is to construct codes with best possible minimum distances. In this paper seven quasi-twisted ternary linear codes are constructed. These codes are new and improve the best known lower bounds on the minimum distance in [6]. 2010 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2016
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2016.01.010